Octagonal Domains for Continuous Constraints
نویسندگان
چکیده
Domains in Continuous Constraint Programming (CP) are generally represented with intervals whose n-ary Cartesian product (box) approximates the solution space. This paper proposes a new representation for continuous variable domains based on octagons. We generalize local consistency and split to this octagon representation, and we propose an octagonal-based branch and prune algorithm. Preliminary experimental results show promising performance improvements on several classical benchmarks.
منابع مشابه
PERFORMANCE OF DIFFERENT ANT-BASED ALGORITHMS FOR OPTIMIZATION OF MIXED VARIABLE DOMAIN IN CIVIL ENGINEERING DESIGNS
Ant colony optimization algorithms (ACOs) have been basically introduced to discrete variable problems and applied to different research domains in several engineering fields. Meanwhile, abundant studies have been already involved to adapt different ant models to continuous search spaces. Assessments indicate competitive performance of ACOs on discrete or continuous domains. Therefore, as poten...
متن کاملWeakly-relational shapes for numeric abstractions: improved algorithms and proofs of correctness
Weakly-relational numeric constraints provide a compromise between complexity and expressivity that is adequate for several applications in the field of formal analysis and verification of software and hardware systems. We address the problems to be solved for the construction of full-fledged, efficient and provably correct abstract domains based on such constraints. We first propose to work wi...
متن کاملOctasom- an Octagonal Based Som Latticestructure for Biomedical Problems
In this study, an octagonal-based self-organizing network’s lattice structure is proposed to allow more exploration and exploitation in updating the weights for better mapping and classification performances. The neighborhood of the octagonal-based lattice structure provides more nodes for the weights updating than standard hexagonal-based lattice structure. Based on our experiment, the octagon...
متن کاملAn Improved Tight Closure Algorithm for Integer Octagonal Constraints
Integer octagonal constraints (a.k.a. Unit Two Variables Per Inequality or UTVPI integer constraints) constitute an interesting class of constraints for the representation and solution of integer problems in the fields of constraint programming and formal analysis and verification of software and hardware systems, since they couple algorithms having polynomial complexity with a relatively good ...
متن کاملThe Seventeenth International Conference on Principles and Practice of Constraint Programming ( CP 2011 ) Doctoral Program
s of Papers in the Main CP 2011 Conference A constraint based approach to cyclic RCPSP . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97 Alessio Bonfietti, Michele Lombardi, Michela Milano and Luca Benini Solving MAXSAT by Solving a Sequence of Simpler SAT Instances . . . . . . . . . . . . . . . . 98 Jessica Davies and Fahiem Bacchus Filtering Algorithms for Discrete Cumulative Problem...
متن کامل